Hardened Bloom Filters, with an Application to Unobservability
نویسندگان
چکیده
منابع مشابه
Hardened Bloom Filters, with an Application to Unobservability
Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership of a given element in the set, with some probability of false positive answers. Bloom filters are often used in caching system to check that some requested data actually exist before doing a co...
متن کاملOn the Application of Bloom Filters to Iris Biometrics
In this work the application of adaptive Bloom filters to binary iris biometric feature vectors, i.e. iris-codes, is proposed. Bloom filters, which have been established as a powerful tool in various fields of computer science, are applied in order to transform iris-codes to a rotation-invariant feature representation. Properties of the proposed Bloom filter-based transform concurrently enable ...
متن کاملBloom filters
Bloom filters are used for answering queries on set membership. In this data structure, the whole element is not stored at the hashed address. Only a few bits are set in an array. Given a set S of cardinality n, we store it in an array of m bits using k hash functions h1(), . . . , hk(). Initially, all the cells in the array are set to 0. Then, for each element in the set, x ∈ S, for each 1 ≤ i...
متن کاملAn Improved Construction for Counting Bloom Filters
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As with a Bloom filter, a CBF obtains space savings by allowing false positives. We provide a simple hashing-based alternative based on d-left hashing called a d-left CBF (dlCBF). The dlCBF offers the same functionality...
متن کاملA Cache Architecture for Counting Bloom Filters: Theory and Application
Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, for example, utilizing multilevel memory hierarchies, special hardware architectures, and hardware threading. In this paper, we introduce a multilevel memory architecture for counting Bloom filters. Based on the probabilities of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Informatica
سال: 2012
ISSN: 2083-3628,1732-1360
DOI: 10.2478/v10065-012-0018-y